A Note on Bilattices and Open Constraint Programming
نویسنده
چکیده
We propose to use bilattice as a constraint valuation structure in order to represent truth and belief at the same time. A bilattice is a set which owns two lattices orderings. They have been used in Artificial Intelligence in order to model incomplete information. We present a framework for Bilattice-valued Constraint Programming which allows to represent incomplete or conflicting information and to combine constraints with a set of operators. It allows to model a variety of situation such as open constraints and the integration of machine learning into constraint programming, reconciliation of divergent opinions in distributed systems or constraint modules in a software engineering perspective.
منابع مشابه
ORE extraction and blending optimization model in poly- metallic open PIT mines by chance constrained one-sided goal programming
Determination a sequence of extracting ore is one of the most important problems in mine annual production scheduling. Production scheduling affects mining performance especially in a poly-metallic open pit mine with considering the imposed operational and physical constraints mandated by high levels of reliability in relation to the obtained actual results. One of the important operational con...
متن کاملBilattices In Logic Programming
Bilattices, introduced by M. Ginsberg, constitute an elegant family of multiple-valued logics. Those meeting certain natural conditions have provided the basis for the semantics of a family of logic programming languages. Now we consider further restrictions on bilattices, to narrow things down to logic programming languages that can, at least in principle, be implemented. Appropriate bilattice...
متن کاملComparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints
The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...
متن کاملA SHORT NOTE ON THE RELATIONSHIP BETWEEN GOAL PROGRAMMING AND FUZZY PROGRAMMING FOR VECTORMAXIMUM PROBLEMS
A theorem was recently introduced to establish a relationship betweengoal programming and fuzzy programming for vectormaximum problems.In this short note it is shown that the relationship does not exist underall circumstances. The necessary correction is proposed.
متن کاملInterval Bilattices and Some Other Simple Bilattices
In a number of papers M.Ginsberg introduced algebras called bilattices having two separate lattice structure and one additional basic unary operation. They originated as an algebraization of some nonclassical logics that arise in artificial intelligence and knowledge-based logic programming. In this paper we introduce some new class of bilattices which originate from interval lattices and show ...
متن کامل